A Crossing Lemma for Multigraphs
نویسندگان
چکیده
منابع مشابه
An adjacency lemma for critical multigraphs
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing’s Adjacency Lemma provides a useful lower bound on the number of vertices of maximum degree adjacent to a given one in a critical graph. We consider an extension of this problem, where we seek information on vertices at distance two from ...
متن کاملA Crossing Lemma for Jordan Curves
If two Jordan curves in the plane have precisely one point in common, and there they do not properly cross, then the common point is called a touching point. The main result of this paper is a Crossing Lemma for simple curves: Let X and T stand for the sets of intersection points and touching points, respectively, in a family of n simple curves in the plane, no three of which pass through the s...
متن کاملMultigraphs (Only) Satisfy a Weak Triangle Removal Lemma
The triangle removal lemma states that a simple graph with o(n3) triangles can be made triangle-free by removing o(n2) edges. It is natural to ask if this widely used result can be extended to multi-graphs. In this short paper we rule out the possibility of such an extension by showing that there are multi-graphs with only n2+o(1) triangles that are still far from being triangle-free. On the ot...
متن کاملA Bipartite Strengthening of the Crossing Lemma
BASIC DEFINITIONS: crossing pair of curves and common interior point between two arcs. crossing number cr(G) minimum number of crossings in a drawing of G l-grid is a pair two disjoint edge subset E1, E2 ⊂ E of a drawing of a graph G = (V, E), such that |E1| = |E2| = l and every edge in E1 crosses every edge in E2 bi-clique complete bipartite graph where vertex classes differ in size by at most...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2018
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-018-00052-z